//vector<int>tmp(m + n);
//int cur = 0, cur1 = 0, cur2 = 0;
//while (cur1 < m && cur2 < n)
//{
//    if (nums1[cur1] <= nums2[cur2])
//        tmp[cur++] = nums1[cur1++];
//    else tmp[cur++] = nums2[cur2++];
//}
//while (cur1 < m)tmp[cur++] = nums1[cur1++];
//while (cur2 < n)tmp[cur++] = nums2[cur2++];
//
//for (int i = 0; i < n + m; i++)
//    nums1[i] = tmp[i];